go/types._TypeSet.terms (field)

28 uses

	go/types (current package)
		predicates.go#L308: 			return xset.terms.equal(yset.terms)
		predicates.go#L325: 			if !xset.terms.equal(yset.terms) {
		typeset.go#L28: 	terms      termlist // type terms of the type set
		typeset.go#L33: func (s *_TypeSet) IsEmpty() bool { return s.terms.isEmpty() }
		typeset.go#L39: func (s *_TypeSet) IsMethodSet() bool { return !s.comparable && s.terms.isAll() }
		typeset.go#L43: 	if s.terms.isAll() {
		typeset.go#L92: 		buf.WriteString(s.terms.String())
		typeset.go#L102: func (s *_TypeSet) hasTerms() bool { return !s.terms.isEmpty() && !s.terms.isAll() }
		typeset.go#L105: func (s1 *_TypeSet) subsetOf(s2 *_TypeSet) bool { return s1.terms.subsetOf(s2.terms) }
		typeset.go#L116: 	for _, t := range s.terms {
		typeset.go#L132: 	for _, t := range s.terms {
		typeset.go#L150: var topTypeSet = _TypeSet{terms: allTermlist}
		typeset.go#L193: 	ityp.tset = &_TypeSet{terms: allTermlist} // TODO(gri) is this sufficient?
		typeset.go#L286: 			terms = tset.terms
		typeset.go#L298: 			terms = tset.terms
		typeset.go#L331: 	ityp.tset.terms = allTerms
		typeset.go#L408: 			terms = computeInterfaceTypeSet(check, pos, ui).terms
		typeset.go#L430: 	unionSets[utyp].terms = allTerms
		typestring.go#L334: 	case s.terms.isAll():
		typestring.go#L336: 	case s.terms.isEmpty():
		typestring.go#L337: 		w.string(s.terms.String())
		typestring.go#L340: 		for _, term := range s.terms {
		unify.go#L484: 			if !xset.terms.equal(yset.terms) {